Computation and Hypercomputation

This paper shows some of the differences and similarities between computation hypercomputation, relating to complexity propositional being propositions that can be decided computationally or hypercomputationally. The methods used are ordinal Turing machines with infinitely long programs diagonalization out computing classes. main results characterization inequalities run time complexities serial, indeterministic serial parallel computers hypercomputers specification a hierarchy hypercompute truths all in standard class model set theory, von Neumann pure sets.